The purpose of this study is to present a weighting factor for considering limitation of salinity on plant water uptake (ω si) for the concept of Integral Water Capacity (IWC). The experiment was conducted under greenhouse conditions and included corn planting in two soil types, three salinity levels (1. 5, 4, and 8 dS m-1), and three replications. After the plants were fully established, all pots were continuously irrigated with a specific salinity. The transpiration values were obtained from the weight differences of pots considering water mass balance components at different times. Cumulative transpiration was calculated at each time step and they were plotted against the drainage water salinity at the same time. Then, using the numerical derivative of the cumulative transpiration curves, the transpiration intensity curve was calculated. By fitting a logarithmic model and their relativization, the effect of salinity Constraint on the transpiration was calculated and a new salinity weighting coefficient was proposed. The results of ω si showed that the relative water uptake decreased logarithmically with increasing salinity and the salinity tolerance of corn varied in soils with different properties and a constant value cannot be reported as salinity tolerance.

Demands for mobile communications are drastically increasing. Nonetheless, these demands cannot be fulfilled because of the limited frequency resources available for mobile communications. More specifically, channel allocation for different uses of frequency resource has emerged a critical issue. This paper presents an adaptive sub-carrier allocation in an orthogonal frequency division multiple access (OFDMA) downlink transmission system. It also attempts to testify the high performance attitude on Capacity compared to the latest available rate in other adaptive OFDMA methods, which maximizes the total system’s Capacity and the total power in bit error rate (BER) Constraints that are subject to proportional rate Constraint (PRC). In this study the expectation value statistic scheduling was formed instead of the random numerical ordering during the first time of the sub-carrier allocation. Furthermore, this scheme was developed via rate allocation, based on the PRC scheme to allocate the channel adaptively among users. The rate of the allocation problem was also formulated to enhance the throughput.

Considering that the issue of choosing the passenger's route and the parameters involved in it has been the focus and study of transportation planners and policymakers for decades, in this article it has been tried to increase the computational efficiency and reduce the data processing time by examining and improving the mathematical model of passenger route selection in previous studies. This issue has been addressed through multi-core data processing (parallel processing) based on the modification of mathematical models presented in previous studies in the form of a public transport dynamic assignment model with the shortest path algorithm based on the schedule and the travel elimination sub-algorithm. The results were compared with the outputs of a non-dynamic model based on the shortest link-based algorithm to measure the effect of considering the Capacity Constraint and dynamics of the algorithm on the calculation time and the accuracy of the output. Even though the number of calculations went up by 13.7% compared to the basic model, the time it took to solve the problem went down by 20% because of parallel processing.

In this paper an uncertain multi objective closed-loop supply chain is developed. The first objective function is maximizing the total profit. The second objective function is minimizing the use of row materials. In the other word, the second objective function is maximizing the amount of remanufacturing and recycling. Genetic algorithm is used for optimization; and for finding the pareto optimal line, Epsilon-Constraint method is used. Finally a numerical example is solved with proposed approach and performance of the model is evaluated in different sizes. The results show that this approach is effective and useful for managerial decisions.

Due to the importance of vehicle routing for delivering a large number of orders with different restrictions in the world, various optimization methods have been studied in past researches. In this article, a number of researches of recent years have been discussed, then the proposed model is described in 3 phases with the penalty index. This model has the ability to assign orders, route vehicles and determine the number of active vehicles dynamically with the aim of minimizing the total cost of distribution. By examining valid metaheuristic models and using their strengths and weaknesses, and considering multiple limitations, a new model of "dynamic 3-phase optimization" has been designed. The main application of the proposed model is for vehicle routing problems with Capacity Constraints of fleet number and Capacity Constraints (maximum and minimum number of orders). Finally, with simulation, the outputs of the model have been analyzed in different conditions . Although the limitation of maximum and minimum Capacity is added to the problem, by dynamically considering the number of vehicles and using star clustering (initiative of this research), three social, environmental and economic dimensions were improved. The time for orders to reach customers decreased by 19.3%, fuel consumption and air pollution by 14.9%, and logistics costs by 8.7%. To calculate the final value of system stability, a unique 3D fuzzy model has been used. With the sensitivity analysis, we came to the conclusion that the 3-phase dynamic optimization model has led to a 14.58% improvement in system stability.

In this paper, we study the location routing problem with intermediate replenishment facilities (LRPIRF), an extension of the location routing problem (LRP), where the vehicles can replenish at some intermediate facilities. Vehicles leave the depot with load on-board, serve customers until out of load, may return to an intermediate facility to replenish, and finally return to the depot, completing their route. In this paper, we initiate a mathematical mixed integer programming model with new kind of subtour elimination Constraints for this problem. Moreover, the facility location phase is considered besides vehicle routing phase in our problem. The objective of the problem is to find routes for vehicles to serve all customers at a minimal cost in terms of total travel cost and total facility location cost, without violating the Capacity Constraint of the vehicles. The solution to the LRPIRF is obtained through CPLEX solver in commercial software GAMS 23.5.1, Genetic Algorithm and Tabu Search algorithm. Computational results are obtained on a set of randomly generated instances and indicate the effectiveness of the proposed algorithms in terms of solution time and quality.

The lack of Quranic approaches in the production of Quran-based humanities is still felt, despite the predominance of the philosophical approach in critical approaches to modern humanities, which has become very common in the Islamic world and in Iran for several decades. It seems that the Capacity of the method of thematic exegesis (al-Tafsīr al-mawdū'ī, Arabic: التفسیر الموضوعیّ) in this regard, can be used to bring the Holy Quran into the field of humanities. Thematic exegesis, according to whether its subject is inside or outside the Qur'an, has several functions in criticizing the structure of modern knowledge and scientific research, as well as the production of Islamic humanities. It is possible to make use of thematic exegesis of the inside of the Holy Book of Quran in order to “fundamental criticism” of the general fundamentals of humanities -the fundamentals of epistemology, axiology, ontology and anthropology- and it is also possible to use thematic exegesis for constructing and producing foundation of humanities obtained from the Holy Quran. It is used by thematic interpretation exegesis of the outside of the Holy Book of Quran -such as Shahīd (martyr) Sadr’s interrogational approach- to answer the problems of humanities and this process faces challenges such as the complexity and multiplicity of the “subject” of the humanities that exist in modern terminology of this field. It can be used in order to solve this issue in some cases to know the process of the change of the components of the modern of the conceptual history’s approach and also by analyzing the issue into several components can be shown that the components are not necessarily a product of the modern era and can be followed up in the Holy Quran and can be found up in the Holy Quran. The perspective of the Holy Quran, after that, regarding the modern subject in the desired field by the “combining” of the results obtained based on the thematic interpretation.

Constrain is the condition of driven by necessity. The principle of Constraint determines the duties of the person constrained. In jurisprudence, it includes a range of activities from cleanness to blood compensation. However, jurisprudents have discussed it mainly with regard to those that can be eaten and drunk, and presented three different interpretations: fear of losing one"s life; fear in general, including fear of losing one"s life, or one"s limb, etc.; and fear of things not related to oneself but to others. The roots of Constraint are compulsion, precautionary concealment, loss and necessity. The present article deals with a kind of Constraint whose source is necessiy. The Qur"an has explicitly excused the person constrained from duties provided that the oppressor shows no inclination to sin. Tradition says that "there is so unlawful act that God Almighty has not made it permissible under Constraint." The intellect also knows it permissible to give up necessary duties and to do the unlawful acts under Constraint. Finally, the writer presents the conditions under which the application of the principle of constrain is made permissible.